New Direct-Product Testers and 2-Query PCPs
نویسندگان
چکیده
منابع مشابه
Small PCPs With Low Query
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proofsize by a large polynomial, or have a high (though constant) query complexity. In this thesis we give a transformation with slightly-super-cubic blowup in proof-size and a low query complexity. Specifically, the verifier probes the proof in 16 bits and rejects every proof of a false assertion with prob...
متن کاملShort PCPs with Polylog Query Complexity
We give constructions of probabilistically checkable proofs (PCPs) of length n · polylog n proving satisfiability of circuits of size n that can verified by querying polylog n bits of the proof. We also give analogous constructions of locally testable codes (LTCs) mapping n information bits to n · polylog n bit long codewords that are testable with polylog n queries. Our constructions rely on n...
متن کاملQuery Efficient PCPs with Perfect Completeness
For every integer k > 0, and an arbitrarily small constant ε > 0, we present a PCP characterization of NP where the verifier uses logarithmic randomness, non-adaptively queries 4k + k2 bits in the proof, accepts a correct proof with probability 1, i. e., it has perfect completeness, and accepts any supposed proof of a false statement with probability at most 2−k 2 + ε . In particular, the verif...
متن کاملNew Proofs of (New) Direct Product Theorems
Direct product theorems are formal statements of the intuition, “It is harder to solve multiple instances of a problem than to solve a single instance.” For this talk, the amplification of hardness will be in reducing the probability of success for a feasible algorithm. So a direct product result for circuits might say, “If no small circuit can compute Boolean function f(x) with probability at ...
متن کاملThree-Query PCPs with Perfect Completeness over non-Boolean Domains
We study non-Boolean PCPs that have perfect completeness and read three positions from the proof. For the case when the proof consists of values from a domain of size d for some integer constant d ≥ 2, we construct a non-adaptive PCP with perfect completeness and soundness d−1+d−2+ε, for any constant ε > 0, and an adaptive PCP with perfect completeness and soundness d−1 + ε, for any constant ε ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2012
ISSN: 0097-5397,1095-7111
DOI: 10.1137/09077299x